Deterministic Methods for Detecting Redundant Linear Constraints in Semidefinite Programming
نویسنده
چکیده
It has been shown that the problem of deterministically classifying constraints in semidefinite programming (SDP) is NP complete. An SDP is constructed that makes it possible to extend some constraint classification results from linear programming (LP) to SDP. Necessary and sufficient conditions for constraint classification, and ultimately, a deterministic method for detecting such are applied to the problem.
منابع مشابه
Identifying Redundant Linear Constraints in Systems of Linear Matrix Inequality Constraints
Semidefinite programming has been an interesting and active area of research for several years. In semidefinite programming one optimizes a convex (often linear) objective function subject to a system of linear matrix inequality constraints. Despite its numerous applications, algorithms for solving semidefinite programming problems are restricted to problems of moderate size because the computa...
متن کاملImplementing an Algorithm for Detecting Redundant Linear Constraints in Semidefinite Programming
We study the system consisting of a linear matrix inequality (LMI) constraint and linear constraints of the form: A(x) := A0 + n ∑ i=1 xiAi 0, bj + a T j x ≥ 0 (j = 1, 2, . . . , q) where Ai are m×m symmetric matrices, aj and x ∈ IR , and bj ∈ IR. A(x) 0 means that A(x) is positive semidefinite. A constraint in the above system is redundant if eliminating it from the system does not change the ...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملMulti-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002